/**
 * Java：寻找最大长度的未覆盖区间
 *
 * @author：紫水木鱼
 * @createDate：2024-07-12 17:40:33
 */
package leetcode.editor.cn;

//Related Topics 数组 排序 👍 1 👎 0

//寻找最大长度的未覆盖区间
class FindMaximalUncoveredRanges {
    public static void main(String[] args) {
        Solution solution = new FindMaximalUncoveredRanges().new Solution();
        // TO TEST
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public String longestWord(String[] words) {
            return null;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)
}